A Note on Amplifying the Error-Tolerance of Locally Decodable Codes

نویسندگان

  • Avraham Ben-Aroya
  • Klim Efremenko
  • Amnon Ta-Shma
چکیده

We show a generic, simple way to amplify the error-tolerance of locally decodable codes. Specifically, we show how to transform a locally decodable code that can tolerate a constant fraction of errors to a locally decodable code that can recover from a much higher error-rate. We also show how to transform such locally decodable codes to locally list-decodable codes. The transformation involves a simple composition with an approximately locally (list) decodable code. Using a construction of such codes by Impagliazzo et al. [IJKW10], the transformation incurs only a negligible growth in the length of the code and in the query complexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locally Decodable Quantum Codes

We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that each of the encoded bits can be recovered with high probability by a measurement on at most q qubits of the quantum code, even if a constant fraction of its qubits have been corrupted adversarially. We show that such a...

متن کامل

Local Testing and Decoding of High-Rate Error-Correcting Codes∗

We survey the state of the art in constructions of locally testable codes, locally decodable codes and locally correctable codes of high rate.

متن کامل

A note on Efremenko's Locally Decodable Codes

There have been three beautiful recent results on constructing short locally decodable codes or LDCs [Yek07, Rag07, Efr09], culminating in the construction of LDCs of subexponential length. The initial breakthrough was due to Yekhanin who constructed 3-query LDCs of sub-exponential length, assuming the existence of infinitely many Mersenne primes [Yek07]. Raghavendra presented a clean formulati...

متن کامل

Locally decodable codes

Locally decodable codes (LDCs) are error correcting codes that simultaneously provide efficient random-access to encoded data and high noise resilience by allowing reliable reconstruction of an arbitrary data bit from looking at only a small number of randomly chosen codeword bits. In this work we survey three known families of LDCs and compare their parameters.

متن کامل

Locally Decodable Codes: A Brief Survey

Locally decodable codes are error correcting codes that simultaneously provide efficient random-access to encoded data and high noise resilience by allowing reliable reconstruction of an arbitrary data bit from looking at only a small number of randomly chosen codeword bits. Local decodability comes at the price of certain loss in terms of code efficiency. Specifically, locally decodable codes ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2010